package com.atguigu.practice;
import java.util.Scanner;
public class TheNumOfFactor {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNextInt()) {
            int n = scanner.nextInt();
            int count=0;
            if (isPrime(n)) {
                System.out.println(1);
            } else {
                for(int i=2;i<=Math.sqrt(n);i++){
                    if(isPrime(i)){
                        if(n%i==0){
                            count++;
                            while(n%i==0){
                                n/=i;
                            }
                        }
                    }
                    if(n==1){
                        System.out.println(count);
                        break;
                    }
                    if(isPrime(n)){
                        count++;
                        System.out.println(count);
                        break;
                    }
                }
            }
        }
    }
    public static boolean isPrime(int n){
        if(n==2)return true;
        for(int i=2;i<Math.sqrt(n);i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }
}
